Methodology for inference on the Markov modulated Poisson process and theory for optimal scaling of the random walk Metropolis

نویسندگان

  • Christopher Sherlock
  • Gareth Roberts
چکیده

Two distinct strands of research are developed: new methodology for inference on the Markov modulated Poisson process (MMPP), and new theory on optimal scaling for the random walk Metropolis (RWM). A novel technique is presented for simulating from the exact distribution of a continuous time Markov chain over an interval given the start and end states and the infinitesimal generator. This is used to create a Gibbs sampler which samples from the exact distribution of the hidden Markov chain in an MMPP. The Gibbs sampler is compared with several Metropolis-Hastings algorithms on a variety of simulated datasets. It is found that the Gibbs sampler is more efficient than all but one of the Metropolis-Hastings algorithms, sometimes by an order of magnitude. One alternative algorithm, with reparameterisation motivated by a Taylor expansion of the MMPP log-likelihood, outperforms the Gibbs sampler when the different Poisson process intensities are similar. The Gibbs sampler is applied to modelling the occurrence of a rare DNA motif. IV Two Lemmas are derived that apply to stationary Metropolis-Hastings Markov chains and simplify the analytical forms for expected acceptance rate and expected square jump distance (ESJD), a measure of efficiency. These are applied to the RWM for elliptically symmetric unimodal targets, and the existence, subject to conditions, of at least one finite optimal scaling is proved in finite dimension d. A one-to-one relationship between acceptance rate and scale parameter is also established. Asymptotic forms for ESJD and expected acceptance rate as d → ∞ are then derived and conditions under which the limiting optimal acceptance rate is 0.234 are obtained. It is also shown that in a more general setting the limiting optimal acceptance rate is ≤ 0.234. Limiting efficiency results are also obtained for partial-blocking and for the exploration of elliptical targets with elliptical proposals of the same shape.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The random walk Metropolis: linking theory and practice through a case study

The random walk Metropolis: linking theory and practice through a case study. Summary: The random walk Metropolis (RWM) is one of the most common Markov Chain Monte Carlo algorithms in practical use today. Its theoretical properties have been extensively explored for certain classes of target, and a number of results with important practical implications have been derived. This article draws to...

متن کامل

Optimal Scaling of Metropolis-coupled Markov Chain Monte Carlo

We consider optimal temperature spacings for Metropolis-coupled Markov chain Monte Carlo (MCMCMC) and Simulated Tempering algorithms. We prove that, under certain conditions, it is optimal to space the temperatures so that the proportion of temperature swaps which are accepted is approximately 0.234. This generalises related work by physicists, and is consistent with previous work about optimal...

متن کامل

Towards optimal scaling of metropolis-coupled Markov chain Monte Carlo

We consider optimal temperature spacings for Metropolis-coupled Markov chain Monte Carlo (MCMCMC) and Simulated Tempering algorithms. We prove that, under certain conditions, it is optimal (in terms of maximising the expected squared jumping distance) to space the temperatures so that the proportion of temperature swaps which are accepted is approximately 0.234. This generalises related work by...

متن کامل

Diffusion Limit for the Random Walk Metropolis Algorithm out of Stationarity

The Random Walk Metropolis (RWM) algorithm is a MetropolisHastings Markov Chain Monte Carlo algorithm designed to sample from a given target distribution π with Lebesgue density on R . Like any other Metropolis-Hastings algorithm, RWM constructs a Markov chain by randomly proposing a new position (the “proposal move”), which is then accepted or rejected according to a rule which makes the chain...

متن کامل

A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS

A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006